Revisiting deadlock prevention: A probabilistic approach
نویسندگان
چکیده
منابع مشابه
Revisiting deadlock prevention: A probabilistic approach
We revisit the deadlock-prevention problem by focusing on priority digraphs instead of the traditional wait-for digraphs. This has allowed us to formulate deadlock prevention in terms of prohibiting the occurrence of directed cycles even in the most general of wait models (the so-called AND-OR model, in which prohibiting wait-for directed cycles is generally overly restrictive). For a particula...
متن کاملAn efficient deadlock prevention approach for service oriented transaction processing
Transaction processing can guarantee the reliability of business applications. Locking resources is widely used in distributed transaction management (e.g., two phase commit, 2PC) to keep the system consistent. The lockingmechanism, however, potentially results in various deadlocks. In service oriented architecture (SOA), the deadlock problem becomes even worse because multiple (sub)transaction...
متن کاملStock Market Fraud Detection, A Probabilistic Approach
In order to have a fair market condition, it is crucial that regulators continuously monitor the stock market for possible fraud and market manipulation. There are many types of fraudulent activities defined in this context. In our paper we will be focusing on "front running". According to Association of Certified Fraud Examiners, front running is a form of insider information and thus is very ...
متن کاملDeadlock Prevention by Acyclic Orientations
Deadlock prevention for routing messages has a central role in communication networks, since it directly innuences the correctness of parallel and distributed systems. In this paper we extend some of the computational results presented in 10] on acyclic orientations for the determination of optimal deadlock free routing schemes. In this context, minimizing the number of buuers needed to prevent...
متن کاملRevisiting Partial-Order Probabilistic Plannin
We present a partial-order probabilistic planning algorithm that adapts plan-graph based heuristics implemented in Repop. We describe our implemented planner, Reburidan, named after its predecessors Repop and Buridan. Reburidan uses plan-graph based heuristics to first generate a base plan. It then improves this plan using plan refinement heuristics based on the success probability of subgoals....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2013
ISSN: 0028-3045
DOI: 10.1002/net.21537